How to Refute an Argument Using Artificial Intelligence
ثبت نشده
چکیده
There is a family of terms in argumentation that are closely related to each other and that all refer to some way in which a given argument is attacked, rebutted, refuted, undercut, critically questioned or objected to, thereby defeating it or casting it into doubt. Proper understanding of this family of terms is fundamental to argumentation theory and to building argumentation technologies in artificial intelligence. This paper refines, clarifies and classifies them, using the Carneades Argumentation System. It begins with a simple example that illustrates two main ways of refuting an argument, and concludes with a seven-step procedure for seeking a refutation or objection.
منابع مشابه
Symbol Grounding and its Implications for Artificial Intelligence
In response to Searle's well-known Chinese room argument against Strong AI (and more generally, computationalism), Harnad proposed that if the symbols manipulated by a robot were sufficiently grounded in the real world, then the robot could be said to literally understand. In this article, I expand on the notion of symbol groundedness in three ways. Firstly, I show how a robot might select the ...
متن کاملArgument diagramming in logic, law and artificial intelligence
In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated informal logic, argumentation theory, evidence law and legal reasoning but also more recent work in applying and developing it in computer science and artificial intelligence (AI). Beginning with a simple example of an everyday argument, we present a...
متن کاملAn Integrative Framework to Protocol Analysis and Repair: Bellare-Rogaway Model + Planning + Model Checker
A modified version of the Bellare and Rogaway (1993) adversarial model is encoded using Asynchronous Product Automata (APA). A model checker tool, Simple Homomorphism Verification Tool (SHVT), is then used to perform state-space analysis on the Automata in the setting of planning problem. The three-party identity-based secret public key protocol (3P-ID-SPK) protocol of Lim and Paterson (2006), ...
متن کاملHow Hard is Artificial Intelligence? Evolutionary Arguments and Selection Effects
Several authors have made the argument that because blind evolutionary processes produced human intelligence on Earth, it should be feasible for clever human engineers to create human-level artificial intelligence in the not-too-distant future. This evolutionary argument, however, has ignored the observation selection effect that guarantees that observers will see intelligent life having arisen...
متن کاملArgument diagramming in logic, law and artificial intelligence
In this paper, we present a survey of the development of the technique of argument diagramming covering not only the fields in which it originated — informal logic, argumentation theory, evidence law and legal reasoning — but also more recent work in applying and developing it in computer science and artificial intelligence (AI). Beginning with a simple example of an everyday argument, we prese...
متن کامل